Likelihood that a pseudorandom sequence generator has optimal properties
نویسندگان
چکیده
The authors prove that the probability of choosing a nonlinear filter of m-sequences with optimal properties, that is, maximum period and maximum linear complexity, tends assymptotically to 1 as the linear feedback shift register length increases. Pseudorandom sequence generators have multiple applications in radar systems, simulation, error-correcting codes, spread-spectrum communication systems and cryptography. One of the most interesting pseudorandom sequence generators is the nonlinear filter of m-sequences, as it produces sequences with optimal properties.
منابع مشابه
On cryptographic properties of LFSR-based pseudorandom generators
Pseudorandom generators (PRGs) are used in modern cryptography to transform a small initial value into a long sequence of seemingly random bits. Many designs for PRGs are based on linear feedback shift registers (LFSRs), which can be constructed in such a way as to have optimal statistical and periodical properties. This thesis discusses construction principles and cryptanalytic attacks against...
متن کاملOn the Randomness of the Editing Generator
In their paper, G.Gong and S.Q.Jiang construct a new pseudorandom sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear...
متن کاملThe Bit-Search Generator
We present the construction of a pseudorandom generator, that we call the Bit-Search Generator (BSG), based on a single input sequence. The construction is related to the so-called Self-Shrinking Generator which is known for its simplicity (conception and implementation-wise) linked with some interesting properties. After presenting the general running, we give a description of the BSG by using...
متن کاملLecture 22 : Pseudorandomness from Hardness
At the early lectures of this class, it was briefly mentioned that if there exist Pseudorandom Generators for this class, then there exists Pseudorandom Generators for all randomized procedures which run in polynomial time. Because any BPP can be simulated by a Boolean circuit, then there exists Pseudorandom Generators for BBP family. In this class the focus will be in completeness, but the dra...
متن کاملInterleaved Sequences of Geometric Sequences Binarized with Legendre Symbol of Two Types
A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1005.2273 شماره
صفحات -
تاریخ انتشار 2010